A Scheduling Method Based on Packet Combination to Improve End-to-End Delay in TSCH Networks with Constrained Latency
نویسندگان
چکیده
منابع مشابه
End-to-End Scheduling in Real-Time Packet-Switched Networks
This paper presents the budgeted-weighted-round-robin (BWRR) algorithm for scheduling the transmission of hardreal-time messages in a packet-switched network. The BWRR algorithm provides a bound on the worst case delay of a message through the network. In addition, with the BWRR algorithm, the necessary buffer space at each switch is predictable and can be fixed at system configuration time. Th...
متن کاملEnd-to-End Delay of Videoconferencing over Packet Switched Networks
Videoconferencing is an important global application it enables people around tha globe to interact when they are far from one another. In order for the participants in a videoconfierence call to interact naturally, the end-to-end delay should be below human perception about 100 tus. Since the global propagation delay can be about 100 ms, the actual end-to-end delay budget available to the syst...
متن کاملOn the Impact of Packet Scheduling on End-to-End Delays in Large Networks
We seek to provide an analytical answer whether the impact of packet scheduling algorithms on end-to-end delays diminishes on long network paths. The answer is provided through a detailed multi-node delay analysis, which is applicable to a broad class of scheduling algorithms, and which can account for statistical multiplexing. The analysis is enabled by two contributions: (1) We derive a funct...
متن کاملImprove End to End Delay with Q-Routing Algorithm
This paper proposed and evaluates a QOS routing policy in packets topology and irregular traffic of communications network called K-shortest Widest paths Q-Routing. The technique used for the evaluation signals of reinforcement is Q-learning. Compared to standard Q-Routing, the exploration of paths is limited to K best non loop paths in term of hops number (number of routers in a path) leading ...
متن کاملOn the Impacts of Traffic Shaping on End-to-End Delay Bounds in Aggregate Scheduling Networks
The Differentiated Services architecture allows for the provision of scalable Quality of Service by means of aggregating flows to a small number of traffic classes. Among these classes a Premium Service is defined, for which end-to-end delay guarantees are of particular interest. However, in aggregate scheduling networks the derivation of such worst case delays is significantly complicated and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energies
سال: 2020
ISSN: 1996-1073
DOI: 10.3390/en13123031